DIAGNOSTICS ON LALR(K) CONFLICTS BASED ON A METHOD FOR LR(K) TESTINGKRISTENSEN BB; MADSEN OL.1981; BIT (NORD. TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1981; VOL. 21; NO 3; PP. 270-293; BIBL. 12 REF.Article

ELIMINATING UNIT REDUCTIONS FROM LR(K) PARSERS USING MINIMUM CONTEXTSTOKUDA T.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 4; PP. 447-470; BIBL. 25 REF.Article

EXTENDING LOOKAHEAD FOR LR PARSERSBAKER TP.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 2; PP. 243-259; BIBL. 14 REF.Article

ON LALR (K) TESTINGSIPPU S; SOISALON SOININEN E.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 208-217; BIBL. 7 REF.Conference Paper

LABR (K) TESTING IS PSPACE-COMPLETEUKKONEN E; SOISALON SOININEN E.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 202-206; BIBL. 10 REF.Conference Paper

EFFICIENT COMPUTATION OF LALR (1) LOOK-AHEAD SETSDEREMER F; PENNELLO TJ.1979; SIGPLAN NOT.; USA; DA. 1979; VOL. 14; NO 8; PP. 176-187; BIBL. 12 REF.Conference Paper